Duality in STRIPS planning
نویسنده
چکیده
We describe a duality mapping between STRIPS planning tasks. By exchanging the initial and goal conditions, taking their respective complements, and swapping for every action its precondition and delete list, one obtains for every STRIPS task its dual version, which has a solution if and only if the original does. This is proved by showing that the described transformation essentially turns progression (forward search) into regression (backward search) and vice versa. The duality sheds new light on STRIPS planning by allowing a transfer of ideas from one search approach to the other. It can be used to construct new algorithms from old ones, or (equivalently) to obtain new benchmarks from existing ones. Experiments show that the dual versions of IPC benchmarks are in general quite difficult for modern planners. This may be seen as a new challenge. On the other hand, the cases where the dual versions are easier to solve demonstrate that the duality can also be made useful in practice.
منابع مشابه
(Economic and Social Duality in Iran (Using Fuzzy Topsis Decision-making
One of the planners and policy-makers’ aims on the one hand is optimum allocating and distributing of credits and facilities among regions and on the other hand is providing and compiling a suitable model aiming at achieving economic and social equity as well as creating reasonable and real economic growth. Paying attention to the balanced regional development, decreasing regional and district ...
متن کاملRRT-Plan: A Randomized Algorithm for STRIPS Planning
We propose a randomized STRIPS planning algorithm called RRT-Plan. This planner is inspired by the idea of Rapidly exploring Random Trees, a concept originally designed for use in continuous path planning problems. Issues that arise in the conversion of RRTs from continuous to discrete spaces are discussed, and several additional mechanisms are proposed to improve performance. Our experimental ...
متن کاملAn Evaluation of Blackbox Graph Planning
In this paper, we investigate a satisfiability-based approach to solving STRIPS planning problems. Traditionally, popular algorithms for STRIPS planning problems include a stable of total-order planners, such as Prodigy, and partial-order planners, such as UCPOP. Blum and Furst introduced a novel way of constructing solutions for these problems called Graphplan, which significantly outperformed...
متن کاملScoring Functions of Approximation of STRIPS Planning by Linear Programming
STRIPS planning is a problem of finding of a set of actions that transform given initial state to desired goal situation. It is hard computational problem. In this work an approximation of STRIPS block world planning by linear programming is shown. Additionally two scoring functions have been introduced to estimate quality of the plan. Proposed approach is illustrated by exemplary simulation.
متن کاملPlanning with Always Preferences by Compilation into STRIPS with Action Costs
We address planning with always preferences in propositional domains, proposing a new compilation schema for translating a STRIPS problem enriched with always preferences (and possibly also soft goals) into a STRIPS problem with action costs. Our method allows many STRIPS planners to effectively address planning with always preferences and soft goals. An experimental analysis indicates that suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.0897 شماره
صفحات -
تاریخ انتشار 2013